Matching properties in connected domination critical graphs
نویسندگان
چکیده
منابع مشابه
Matching properties in connected domination critical graphs
A dominating set of vertices S of a graph G is connected if the subgraph G[S] is connected. Let c(G) denote the size of any smallest connected dominating set in G. A graph G is k-connected-critical if c(G)= k, but if any edge e ∈ E(Ḡ) is added to G, then c(G+ e) k − 1. This is a variation on the earlier concept of criticality of edge addition with respect to ordinary domination where a graph G ...
متن کاملCritical graphs with respect to total domination and connected domination
A graph G is said to be k-γt-critical if the total domination number γt(G) = k and γt(G + uv) < k for every uv / ∈ E(G). A k-γc-critical graph G is a graph with the connected domination number γc(G) = k and γc(G + uv) < k for every uv / ∈ E(G). Further, a k-tvc graph is a graph with γt(G) = k and γt(G− v) < k for all v ∈ V (G), where v is not a support vertex (i.e. all neighbors of v have degre...
متن کاملCritical properties on Roman domination graphs
A Roman domination function on a graph G is a function r : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman function is the value r(V (G)) = ∑ u∈V (G) r(u). The Roman domination number γR(G) of G is the minimum weight of a Roman domination function on G . "Roman Criticality" has been ...
متن کاملGeneralized connected domination in graphs
As a generalization of connected domination in a graph G we consider domination by sets having at most k components. The order γ c (G) of such a smallest set we relate to γc(G), the order of a smallest connected dominating set. For a tree T we give bounds on γ c (T ) in terms of minimum valency and diameter. For trees the inequality γ c (T ) ≤ n− k − 1 is known to hold, we determine the class o...
متن کاملConnected domination of regular graphs
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either v ∈ D or there exists a vertex u ∈ D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating set C of a graph G is a dominating set of G such that the subgraph induced by the vertices of C in G is connected. A weakly-connected dominating set W of a g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.03.073